Nonlinear Optimization: Trust Region Algorithms

نویسنده

  • Ya-xiang Yuan
چکیده

In this paper, we review the trust region algorithms for nonlinear optimization. The philosophy and the fundamental ideas of trust region algorithms are discussed. Model algorithms for unconstrained optimization, constrained optimization, and nonsmooth optimization are given. Main techniques for global convergence and local superlinear convergence are analyzed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nonlinear stepsize control, trust regions and regularizations for unconstrained optimization

A general class of algorithms for unconstrained optimization is introduced, which subsumes the classical trust-region algorithm and two of its newer variants, as well as the cubic and quadratic regularization methods. A unified theory of global convergence to first-order critical points is then described for this class. An extension to projection-based trust-region algorithms for nonlinear opti...

متن کامل

یک الگوریتم کارا برای زیر مساله‌ی ناحیه‌ اطمینان توسیع یافته با دو قید خطی

Trust region subproblem (TRS), which is the problem of minimizing a quadratic function over a ball, plays a key role in solving unconstrained nonlinear optimization problems. Though TRS is not necessarily convex, there are efficient algorithms to solve it, particularly in large scale. Recently, extensions of TRS with extra linear constraints have received attention of several researchers. It ha...

متن کامل

On Efficiency of Non-Monotone Adaptive Trust Region and Scaled Trust Region Methods in Solving Nonlinear Systems of Equations

In this paper we run two important methods for solving some well-known problems and make a comparison on their performance and efficiency in solving nonlinear systems of equations‎. ‎One of these methods is a non-monotone adaptive trust region strategy and another one is a scaled trust region approach‎. ‎Each of methods showed fast convergence in special problems and slow convergence in other o...

متن کامل

A trust region algorithm for constrained optimization

We review the main techniques used in trust region algorithms for nonlinear constrained optimization. 1. Trust Region Idea Constrained optimization is to minimize a function subject to finitely many algebraic equation and inequality conditions. It has the following form

متن کامل

Global Convergence of a Class of Trust Region Algorithms for Optimization Using Inexact Projections on Convex Constraints

A class of trust region based algorithms is presented for the solution of nonlinear optimization problems with a convex feasible set. At variance with previously published analysis of this type, the theory presented allows for the use of general norms. Furthermore, the proposed algorithms do not require the explicit computation of the projected gradient, and can therefore be adapted to cases wh...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007